Towards an Erlang formula for multiclass networks
نویسندگان
چکیده
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load balancing schemes. Given Poisson arrival and exponential service requirements, the number of customers in the network evolves as a multi-dimensional birth-and-death process on a finite subset of N. We assume that the death (i.e. service) rates and the birth rates depending on the whole state of the system, satisfy a local balance condition. This makes the resulting network a so-called Whittle network and the stochastic process describing the state of the network is reversible with an explicit stationary distribution that is in fact insensitive to the service time distribution. Given routing constraints, we are interested in the optimal performance of such networks. We first construct bounds for generic performance criteria, that can be evaluated using recursive procedures, these bounds being attained in the case of a unique arrival process. We then study the case of several arrival processes, focusing in particular on the instance with admission control only. Building on convexity properties, we characterize the optimal policy, and give criteria on the service rates for which our bounds are again attained.
منابع مشابه
On the Performance of Dynamic Online QoS Routing Schemes
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is available in the literature. In this paper, after a short review of the major dynamic QoS routing schemes, we analyze and compare their performance referring to several networks scenarios. In order to set an absolute eva...
متن کاملUTILIZATION OF 1st ERLANG FORMULA IN ASYNCHRONOUS NETWORKS
This paper emphasizes a possibility for the utilization the 1st Erlang formula in asynchronous networks. This statement is possible on the basis of research of statistical features of traffic source input flow. We consider ATM network type where in the case of VP important parameters are as follows: loss B , link utilization ρ and bandwidth c . The evidence for utilization the 1st Erlang formul...
متن کاملTowards an Erlang-Like Formula for the Performance Evaluation of GPRS/EDGE Networks with Finite-Length Sessions
In this paper, we focus on a simple yet important objective: to provide Erlang-like models for GPRS/EDGE radio engineering. To this end, we develop a constructive model based on an original discretetime Markov process that captures the detailed behavior of the radio allocator when a finite number of users are performing ON/OFF sessions in the cell. After a preliminary focus on infinite-length s...
متن کاملUsage of Erlang Formula in IP Networks
This paper is concerning of Erlang formulas practical approval and their usage with video flow transfer in IP networks. Erlang formulas were simulated in MATLAB program. Practical verification was realized in defined environment by using of designed video source. The result is comparison of loss calculated by MATLAB and loss of real video data transfer.
متن کاملOn equilibrium analysis of acyclic multiclass loss networks under admission control
We consider equilibrium analysis of several dynamic resource sharing policies for multiclass loss networks with acyclic topologies. The policies of interest are based on the principle of prioritizing classes via thresholding or reservation. We show that under each policy the equilibrium network state is a Markov random field and we obtain closed form expressions for the conditional probabilitie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 66 شماره
صفحات -
تاریخ انتشار 2010